Degree tolerant coloring: Graphs from graphs
نویسندگان
چکیده
منابع مشابه
Partitioning and coloring graphs with degree constraints
We prove that if G is a vertex-critical graph with χ(G) ≥ ∆(G) + 1 − p ≥ 4 for some p ∈ N and ω(H(G)) ≤ χ(G)+1 p+1 − 2, then G = Kχ(G) or G = O5. Here H(G) is the subgraph of G induced on the vertices of degree at least χ(G). This simplifies the proofs and improves the results in the paper of Kostochka, Rabern and Stiebitz [8].
متن کاملEdge coloring regular graphs of high degree
We discuss the following conjecture: If G = (V; E) is a-regular simple graph with an even number of vertices at most 22 then G is edge colorable. In this paper we show that the conjecture is true for large graphs if jV j < (2 ?)). We discuss related results.
متن کاملColoring graphs of various maximum degree from random lists
Let G = G(n) be a graph on n vertices with maximum degree ∆ = ∆(n). Assign to each vertex v of G a list L(v) of colors by choosing each list independently and uniformly at random from all k-subsets of a color set C of size σ = σ(n). Such a list assignment is called a random (k, C)-list assignment. In this paper, we are interested in determining the asymptotic probability (as n → ∞) of the exist...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملEdge-face coloring of plane graphs with maximum degree nine
An edge-face colouring of a plane graph with edge set E and face set F is a colouring of the elements of E ∪ F so that adjacent or incident elements receive different colours. Borodin [Simultaneous coloring of edges and faces of plane graphs, Discrete Math., 128(1-3):21–33, 1994] proved that every plane graph of maximum degree ∆ > 10 can be edge-face coloured with ∆ + 1 colours. We extend Borod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2020
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0804/0009